Reflection principles, GCH and the uniformization properties

نویسندگان

چکیده

Reflection principles (or dually speaking, compactness principles) often give rise to combinatorial guessing principles. Uniformization properties, on the other hand, are examples of anti-guessing We discuss tension and compatibility between reflection uniformization properties at level second uncountable cardinal.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Uniformization and Anti-uniformization Properties of Ladder Systems

Let S denote a stationary subset of limit ordinals of ω1. A ladder system on S is a sequence {Lα : α ∈ S} such that each Lα is an unbounded subset of α of order type ω. A ladder system is uniformizable if for each sequence 〈fα : α ∈ S〉 of functions fα : Lα → ω there is an F : ω1 → ω such that F Lα =∗ fα for each α ∈ S. I.e., for each α ∈ S, {β ∈ Lα : F (β) 6= fα(β)} is finite. We now formulate ...

متن کامل

Stationary reflection principles and two cardinal tree properties

We study consequences of stationary and semi-stationary set reflection. We show that the semi-stationary reflection principle implies the Singular Cardinal Hypothesis, the failure of weak square principle, etc. We also consider two cardinal tree properties introduced recently by Weiss and prove that they follow from stationary and semi-stationary set reflection augmented with a weak form of Mar...

متن کامل

Uniformization of the Orbifold of a Finite Reflection Group

We try to understand the relationship between the K(π, 1)-property of the complexified regular orbit space of a finite reflection group and the flat structure on the orbit space via the uniformization equation attached to the flat structure.

متن کامل

Reflection principles for the continuum∗

Let HC ′ denote the set of sets of hereditary cardinality less than 2ω. We consider reflection principles for HC ′ in analogy with the Levy reflection principle for HC. Let B be a class of complete Boolean algebras. The principle Max(B) says: If R(x1, . . . , xn) is a property which is provably persistent in extensions by elements of B, then R(a1, . . . , an) holds whenever a1, . . . , an ∈ HC ...

متن کامل

On reflection principles

Gödel initiated the program of finding and justifying axioms that effect a significant reduction in incompleteness and he drew a fundamental distinction between intrinsic and extrinsic justifications. Reflection principles are the most promising candidates for new axioms that are intrinsically justified. Taking as our starting point Tait’s work on general reflection principles, we prove a serie...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Israel Journal of Mathematics

سال: 2022

ISSN: ['1565-8511', '0021-2172']

DOI: https://doi.org/10.1007/s11856-022-2386-3